Detour trees
نویسندگان
چکیده
منابع مشابه
Energy-efficient Traffic-aware Detour Trees for Geographical Routing
Tree routing is one of the detouring strategies employed in geographic routing to help find a detour for a packet to leave a local minimum. The effectiveness of tree routing depends on the quality of the pre-constructed routing trees. Existing tree construction methods build trees in a top-down and centralized fashion and do not consider the traffic pattern and residual energy of the network. T...
متن کاملComputing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles
The maximum detour and spanning ratio of an embedded graph G are values that measure how well G approximates Euclidean space and the complete Euclidean graph, respectively. In this paper we describe O(n logn) time algorithms for computing the maximum detour and spanning ratio of a planar polygonal path. These algorithms solve open problems posed in at least two previous works [5,10]. We also ge...
متن کاملOn edge detour graphs
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...
متن کاملNontraceable detour graphs
The detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v). The detour sequence of G is a sequence consisting of the detour orders of its vertices. A graph is called a detour graph if its detour sequence is constant. The detour deficiency of a graph G is the difference between the order of G and its detour order. Homogeneously traceable graphs are therefore de...
متن کاملDetour Chromatic Numbers
The nth detour chromatic number, χn(G) of a graph G is the minimum number of colours required to colour the vertices of G such that no path with more than n vertices is monocoloured. The number of vertices in a longest path of G is denoted by τ (G) . We conjecture that χn(G) ≤ d τ(G) n e for every graph G and every n ≥ 1 and we prove results that support the conjecture. We also present some suf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.02.002